Tabu Programming Method: A New Meta-Heuristics Algorithm Using Tree Data Structures for Problem Solving
نویسندگان
چکیده
The core of artificial intelligence and machine learning is to get computers to solve problems automatically. One of the great tools that attempt to achieve that goal is Genetic Programming (GP). GP is a generalization procedure of the well-known meta-heuristic of Genetic Algorithms (GAs). Meta-heuristics have shown successful performance in solving many combinatorial search problems. In this paper, we introduce a more general framework of meta-heuristics called MetaHeuristics Programming (MHP) as general machine learning tools. As an alternative to GP, Tabu Programming (TP) is proposed as a special procedure of MHP frameworks. One of the main features of MHP is to exploit local search in order to overcome some drawbacks of GP, especially high disruption of its main operations; crossover and mutation. We show the efficiency of the proposed TP method through numerical experiments.
منابع مشابه
Three Metaheuristic Algorithms for Solving the Multi-item Capacitated Lot-sizing Problem with Product Returns and Remanufacturing
This paper proposes a new mixed integer programming model for multi-item capacitated lot-sizing problem with setup times, safety stock and demand shortages in closed-loop supply chains. The returned products from customers can either be disposed or be remanufactured to be sold as new ones again. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA) al...
متن کاملA New Mathematical Model for a Multi-product Supply Chain Network with a Preventive Maintenance Policy
The supply chain network design (SCND) implicates decision-making at a strategic level and makes it possible to create an effective and helpful context for managing. The aim of the network is to minimize the total cost so that customer's demands should be met. Preventive maintenance is pre-determined work performed to a schedule with the aim of preventing the wear and tear or sudden failure of ...
متن کاملAn integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method
In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP. They are routing problem and sequencing problem. If both the sub problems are solved simultaneously, t...
متن کاملSolving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method
In this paper, a leader–follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services ar...
متن کاملSolving a Multi-Item Supply Chain Network Problem by Three Meta-heuristic Algorithms
The supply chain network design not only assists organizations production process (e.g.,plan, control and execute a product’s flow) but also ensure what is the growing need for companies in a longterm. This paper develops a three-echelon supply chain network problem including multiple plants, multiple distributors, and multiple retailers with amulti-mode demand satisfaction policy inside of pro...
متن کامل